simple groups with the same prime graph as $d_n(q)$
Authors
abstract
vasil'ev posed problem 16.26 in [the kourovka notebook: unsolved problems in group theory, 16th ed.,sobolev inst. math., novosibirsk (2006).] as follows:does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? conjecture: $k = 5$.in [zvezdina, on nonabelian simple groups having the same prime graph as an alternating group, siberian math. j., 2013] the above conjecture is positively answered when one of these pairwise nonisomorphic groups is an alternating group.in this paper, we continue this work and determine all nonabelian simple groups, which have the same prime graph as the nonabelian simple group $d_n(q)$.
similar resources
Simple groups with the same prime graph as $D_n(q)$
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
full textOn some Frobenius groups with the same prime graph as the almost simple group ${ {bf PGL(2,49)}}$
The prime graph of a finite group $G$ is denoted by $Gamma(G)$ whose vertex set is $pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $Gamma(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by prime graph if there is a finite group $H$ with $Gamma(H)=Gamma(G)$, in while $Hnotcong G$. In this paper, we consider finite groups with the same prime gr...
full textSIMPLE GROUPS WITH THE SAME PRIME GRAPH AS 2Dn(q)
In 2006, Vasil’ev posed the problem: Does there exist a positive integer k such that there are no k pairwise nonisomorphic nonabelian finite simple groups with the same graphs of primes? Conjecture: k = 5. In 2013, Zvezdina, confirmed the conjecture for the case when one of the groups is alternating. We continue this work and determine all nonabelian simple groups having the same prime graphs a...
full textGroups with the Same Prime Graph as an Almost Sporadic Simple Group
Let G be a finite group. We denote by Γ(G) the prime graph of G. Let S be a sporadic simple group. M. Hagie in (Hagie, M. (2003), The prime graph of a sporadic simple group, Comm. Algebra, 31: 44054424) determined finite groups G satisfying Γ(G) = Γ(S). In this paper we determine finite groups G such that Γ(G) = Γ(A) where A is an almost sporadic simple group, except Aut(McL) and Aut(J2).
full textON COMPOSITION FACTORS OF A GROUP WITH THE SAME PRIME GRAPH AS Ln(5)
The prime graph of a finite group $G$ is denoted by$ga(G)$. A nonabelian simple group $G$ is called quasirecognizable by primegraph, if for every finite group $H$, where $ga(H)=ga(G)$, thereexists a nonabelian composition factor of $H$ which is isomorphic to$G$. Until now, it is proved that some finite linear simple groups arequasirecognizable by prime graph, for instance, the linear groups $L_...
full text2-recognizability of the simple groups $B_n(3)$ and $C_n(3)$ by prime graph
Let $G$ be a finite group and let $GK(G)$ be the prime graph of $G$. We assume that $ngeqslant 5 $ is an odd number. In this paper, we show that the simple groups $B_n(3)$ and $C_n(3)$ are 2-recognizable by their prime graphs. As consequences of the result, the characterizability of the groups $B_n(3)$ and $C_n(3)$ by their spectra and by the set of orders of maximal abelian subgroups are ...
full textMy Resources
Save resource for easier access later
Journal title:
bulletin of the iranian mathematical societyجلد ۴۲، شماره ۶، صفحات ۱۴۰۳-۱۴۲۷
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023